Er jeg min broders vogter?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Min-min Max-min Algorithm with Improved Performance

The high cost of supercomputers and the need for large-scale computational resources has led to the development of network of computational resources known as Grid. To better use tremendous capabilities of this large scale distributed system, effective and efficient scheduling algorithms are needed. Many such algorithms have been designed and implemented. We introduce a new scheduling algorithm...

متن کامل

Min-up/min-down polytopes

In power generation and other production settings, technological constraints force restrictions on the number of time-periods that a machine must stay up once activated, and stay down once deactivated. We characterize the polyhedral structure of a model representing these restrictions. We also describe a cutting-plane method for solving integer programs involving such min-up and min-down times ...

متن کامل

Maltooligosaccharides from JEG-3 trophoblast-like cells exhibit immunoregulatory properties.

PROBLEM to better understand the immunoregulatory properties of trophoblasts, we have searched for small immunologically active carbohydrates derived from intact trophoblast-like cells. METHOD OF STUDY using solid phase extraction coupled with HPLC and mass spectrometry methods, we have characterized a low molecular weight carbohydrate-rich fraction associated with JEG-3 cells. We have also t...

متن کامل

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

متن کامل

Resource Allocation with improved Min-Min Algorithm

A distributed system is a software system in which components located on networked computers communicate and coordinate their actions by passing messages. Most of the existing solutions on task scheduling and resource management in distributed computing environment are based on the traditional client/ server model, enforcing a homogeneous policy on making decisions and limiting the flexibility,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Samfundslederskab i Skandinavien

سال: 2020

ISSN: 2596-6200

DOI: 10.22439/sis.v35i4.6028